Inferring scope through syntactic sugar

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inferring Scope through Syntactic Sugar (Extended Version)

Many languages use syntactic sugar to define parts of their surface language in terms of a smaller core. Thus some properties of the surface language, like its scoping rules, are not immediately evident. Nevertheless, ides, refactorers, and other tools that traffic in source code depend on these rules to present information to users and to soundly perform their operations. In this paper, we sho...

متن کامل

Resugaring: Lifting Languages through Syntactic Sugar

Syntactic sugar is pervasive in language technology. Programmers use it to shrink the size of a core language; to define domain-specific languages; and even to extend their language. Unfortunately, when syntactic sugar is eliminated by transformation, it obscures the relationship between the user’s source program and the program being evaluated. First, it obscures the evaluation steps the progr...

متن کامل

Syntactic Sugar

A plea is made for being honest with TEX and not imposing alien structures upon it, other than via compatible extensions, or via (non-TEX) user interfaces to suit the publisher, the author, or the typist. This will facilitate the process of producing (complex) publications effectively, and typographcally of hgh-quality.

متن کامل

Scope as Syntactic Abstraction

What is the logic of scope? By “scope”, I mean scopetaking in natural languages such as English, as illustrated by the sentence Ann saw everyone. In this example, the quantifier denoted by everyone takes scope over the rest of the sentence, that is, it takes the denotation of the rest of the sentence as its semantic argument: everyone(λx.saw(x)(ann)). The answer I will give here will be to prov...

متن کامل

Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming

This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target texts and uses a machine-learning technique, namely inductive logic programming, to automatically infer rules called syntactic alignment rules. These rules make the most of the syntactic information to align words. This ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on Programming Languages

سال: 2017

ISSN: 2475-1421

DOI: 10.1145/3110288